Making the Original Scoreboard Mechanism Deadlock Free
نویسندگان
چکیده
Very recently, it was shown that the well known scoreboard as introduced in the CDC 6600 and described in current textbooks runs into deadlocks. However, it is one of the two major scheduling mechanisms used in todays microprocessors. This paper presents a corrected version of the scoreboard and formally proves that mechanism to be correct and deadlock free.
منابع مشابه
A minimal property for characterizing deadlock-free programs
A fundamental issue in the development of concurrent programs is the resource allocation problem. Roughly speaking, it consists of providing some mechanism to avoid race conditions in the access of shared resources by two or more concurrent processes. For such a task, maybe the most widely mechanism consists of using critical sections. Unfortunately, it is also widely-known that programs which ...
متن کاملA Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of which can scale routing performance according to traffic loads without changing the routing algorithm. However, there is no existing fault-tolerant routing strategy for GCs as well as node/link diluted cubes. In this p...
متن کاملA Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
This paper presents a modified priority based probe algorithm for deadlock detection and resolution in distributed database systems. The original priority based probe algorithm was presented by Sinha and Natarajan based on work by Chandy, Misra, and Haas. Various examples are used to show that the original priority based algorithm either fails to detect deadlocks or reports deadlocks which do n...
متن کاملDeadlock-Free TCP Over High- Speed Internet
In this paper, we consider TCP throughput deadlock problems caused by an interplay between the Nagle algorithm, delayed acknowledgment algorithm, and several implementation details. For some combinations of send and receive buffers, a TCP sender cannot send more segments due to the Nagle algorithm and, at the same time, a TCP receiver cannot acknowledge more segments received due to the delayed...
متن کاملDeadlock properties of queueing networks with finite capacities and multiple routing chains
Blocking in queueing network models with nite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and suucient conditions for deadlock-free queueing networks with blocking are provided. An optimization algorithm is presented for nding deadlock-free capacity assignments with the least tot...
متن کامل